On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions
نویسندگان
چکیده
We show that, for any collection H of n hyperplanes in < 4 , the combinato-rial complexity of the vertical decomposition of the arrangement A(H) of H is O(n 4 log n). The proof relies on properties of superimposed convex subdivisions of 3-space, and we also derive some other results concerning them.
منابع مشابه
Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
We prove tight and near-tight combinatorial complexity bounds for vertical decompositions of arrangements of hyperplanes and 3-simplices in four dimensions. In particular, we prove a tight upper bound of Θ(n) for the vertical decomposition of an arrangement of n hyperplanes in four dimensions, improving the best previously known bound [8] by a logarithmic factor. We also show that the complexit...
متن کاملInvestigation the Effect of Strengthening Various Subpanels in the SPSPs with Two Rectangular Openings
In the present research, behavior of SPSPs with two rectangular openings and effect of strengthening different subpanels with various stiffener arrangements is investigated. In the next step, to investigate the effect of changing opening width on the trend of degradation shear stiffness and strength of the panel, the opening width is changed. In the third step, to study the effect of changing o...
متن کامل30 Arrangements
Given a finite collection S of geometric objects such as hyperplanes or spheres in R , the arrangement A(S) is the decomposition of R into connected open cells of dimensions 0, 1, . . . , d induced by S. Besides being interesting in their own right, arrangements of hyperplanes have served as a unifying structure for many problems in discrete and computational geometry. With the recent advances ...
متن کاملARRANGEMENTS Dan Halperin and Micha Sharir
Given a finite collection S of geometric objects such as hyperplanes or spheres in R , the arrangement A(S) is the decomposition of R into connected open cells of dimensions 0, 1, . . . , d induced by S. Besides being interesting in their own right, arrangements of hyperplanes have served as a unifying structure for many problems in discrete and computational geometry. With the recent advances ...
متن کاملDecomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
This work is motivated by several basic problems and techniques that rely on space decomposition of arrangements of hyperplanes in high-dimensional spaces, most notably Meiser’s 1993 algorithm for point location in such arrangements. A standard approach to these problems is via random sampling, in which one draws a random sample of the hyperplanes, constructs a suitable decomposition of its arr...
متن کامل